A Lower Bound for the Height of a Rational Function at S-unit Points

2 2 A pr 2 00 4 A lower bound for the height of a rational function at S - unit points Pietro

Abstract. Let a, b be given multiplicatively independent positive integers and let ǫ > 0. In a recent paper written jointly also with Y. Bugeaud we proved the upper bound exp(ǫn) for gcd(a − 1, b − 1); shortly afterwards we generalized this to the estimate gcd(u− 1, v − 1) < max(|u|, |v|), for multiplicatively independent S-units u, v ∈ Z. In a subsequent analysis of those results it turned out...

Points at Rational Distance from the Vertices of a Unit Polygon

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

points at rational distance from the vertices of a unit polygon